Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

A thorough and accessible introduction to a range of key ideas in type systems for programming language.The study of type systems for programming languages now touches many areas of computer science, from language design and implementation to software engineering, network security, databases, and analysis of concurrent and distributed systems. This book offers accessible introductions to key ideas in the field, with contributions by experts on each topic.The topics covered include precise type analyses, which extend simple type systems to give them a better grip on the run time behavior of systems; type systems for low-level languages; applications of types to reasoning about computer programs; type theory as a framework for the design of sophisticated module systems; and advanced techniques in ML-style type inference.Advanced Topics in Types and Programming Languages builds on Benjamin Pierce's Types and Programming Languages (MIT Press, 2002); most of the chapters should be accessible to readers familiar with basic notations and techniques of operational semantics and type systems--the material covered in the first half of the earlier book.Advanced Topics in Types and Programming Languages can be used in the classroom and as a resource for professionals. Most chapters include exercises, ranging in difficulty from quick comprehension checks to challenging extensions, many with solutions.

Programming --- Programming languages (Electronic computers) --- Langages de programmation --- Programming languages (Electronic computers). --- 681.3*D32 --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- 681.3*D32 language classifications: applicative languages; data-flow languages; design languages; extensible languages; macro and assembly languages; nonprocedural languages; specialized application and very high-level languages (Programminglanguages) --- Acqui 2006 --- COMPUTER SCIENCE/Programming Languages

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Category theory is a branch of pure mathematics that is becoming an increasingly important tool in theoretical computer science, especially in programming language semantics, domain theory, and concurrency, where it is already a standard language of discourse. Assuming a minimum of mathematical preparation, Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories. Four case studies illustrate applications of category theory to programming language design, semantics, and the solution of recursive domain equations. A brief literature survey offers suggestions for further study in more advanced texts. Benjamin C. Pierce received his doctoral degree from Carnegie Mellon University. Contents : Tutorial. Applications. Further Reading.

Computer science --- Categories (Mathematics) --- Mathematics --- Mathematics. --- Categories (Mathematics). --- Category theory (Mathematics) --- Algebra, Homological --- Algebra, Universal --- Group theory --- Logic, Symbolic and mathematical --- Topology --- Functor theory --- Computer mathematics --- Electronic data processing --- Computer science - Mathematics --- Algebra --- COMPUTER SCIENCE/General

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Information Technology --- Computer Science (Hardware & Networks)